Rendezvous in Highly-dynamic CRNs: A Frequency Hopping Approach
نویسندگان
چکیده
Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to “rendezvous” before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. Current FH rendezvous designs have two main limitations. First, they do not account for fast primary user (PU) dynamics. Second, they mainly target pairwise rendezvous, and do not intrinsically support multicast rendezvous. In this paper, we first design a grid-quorum-based FH algorithm, denoted by NGQFH, for pairwise rendezvous. NGQFH can achieve efficient rendezvous under fast PU dynamics. It is also robust against node compromise. Using the uniform k-arbiter and Chinese Remainder Theorem quorum systems, we then propose three multicast rendezvous algorithms: AMQFH, CMQFH, and nestedCMQFH, which provide different tradeoffs between the time-to-rendezvous and robustness to node compromise. Our pairwise and multicast rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA networks. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through an optimal mechanism for channel sensing and assignment, and a quorum selection mechanism. Extensive simulations are used to evaluate our algorithms. Index Terms Control channel, dynamic frequency hopping, dynamic spectrum access, quorum systems.
منابع مشابه
Channel Hopping Sequences for Maximizing Rendezvous Diversity in Cognitive Radio Networks
In cognitive radio networks (CRNs), establishing a communication link between a pair of secondary users (SUs) requires them to rendezvous on a common channel which is not occupied by primary users (PUs). Under time-varying PU traffic, asynchronous sequence-based channel hopping (CH) with the maximal rendezvous diversity is a representative technique to guarantee an upper bounded time-torendezvo...
متن کاملToward Efficient Channel Hopping for Communication Rendezvous in Dynamic Spectrum Access Networks
—We present ETCH, efficient channel hopping based MAC-layer protocols for communication rendezvous in Dynamic Spectrum Access (DSA) networks. Compared to the existing solutions, ETCH fully utilizes spectrum diversity in communication rendezvous by allowing all the rendezvous channels to be utilized at the same time. We propose two protocols, SYNC-ETCH, which is a synchronous protocol assuming D...
متن کاملRendezvous Protocols and Dynamic Frequency Hopping Interference Design for Anti-jamming Satellite Communication
متن کامل
A Tutorial on Multichannel Rendezvous in Cognitive Radio Networks
Rendezvous search that asks two persons to find each other among a set of possible locations has regained tremendous research interest lately in the research community of cognitive radio networks (CRNs). In a CRN, there are two types of users: primary spectrum users (PUs) and secondary spectrum users (SUs). SUs are only allowed to share spectrum with PUs provided that they do not cause any seve...
متن کاملRendezvous in Dynamic Spectrum Wireless Networks
Establishing communications in a dynamic spectrum access (DSA) network requires the communicating parties to “rendezvous” before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. Previous FH-based rendezvous designs do not account for fast primary user (PU) dynamics, which results in extreme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012